Robust constrained fuzzy clustering

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust constrained fuzzy clustering

It is well-known that outliers and noisy data can be very harmful when applying clustering methods. Several fuzzy clustering methods which are able to handle the presence of noise have been proposed. In this work, we propose a robust clustering approach called F-TCLUST based on an “impartial” (i.e., self-determined by data) trimming. The proposed approach considers an eigenvalue ratio constrain...

متن کامل

Semi-fuzzy and robust semi-fuzzy clustering

Allowing the similarity measure to be negative, this paper generalizes the clustering model to include not only the traditional hard and fuzzy clustering but also a new semi-fuzzy clustering. Then the robust semi-fuzzy clustering is introduced and used for brain MR image segmentation.

متن کامل

Fuzzy Clustering and Robust Estimation

A modified version of the fuzzy k-means clustering is proposed for gelling the robustness (the resistance) against a few outliers. Some numerical examples are presented for illustrating the intuitively appropriate interpretation the modified method provides, and it is pointed out that the estimator of the typical value (the population mean) obtained in one-cluster case is equivalent to a kind o...

متن کامل

A fast algorithm for robust constrained clustering

The application of “concentration” steps is the main principle behind Forgy’s kmeans algorithm and Rousseeuw and van Driessen’s fast-MCD algorithm. Although they share this principle, it is not completely straightforward to combine both algorithms for developing a clustering method which is not affected by a certain proportion of outlying observations and that is able to cope with non spherical...

متن کامل

A Robust Fuzzy Kernel Clustering Algorithm

Traditional fuzzy kernel clustering methods does Iterative clustering in the original data space or in the feature space by mapping the samples into high-dimensional feature space through a kernel function These methods with normalized fuzzy degree of membership has weak robustness against noises and outliers, and lack of effective kernel parameter selection method. To overcome these problems, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Sciences

سال: 2013

ISSN: 0020-0255

DOI: 10.1016/j.ins.2013.03.056